Three-dimensional Computations of Time-dependent Incompressible Flows with an Implicit Multigrid-driven Algorithm on Parallel Computers
نویسندگان
چکیده
The present work is aimed at the development of a robust, computationally efficient algorithm for the simulation of unsteady incompressible flows of interest in engineering. In particular, we focus on the extension of a fully-implicit multigr~d driven algorithm, orig/nally proposed and vaJhdated for both the two-dimensional Euler and Navier-Stokes equations in references [1,2], to three dimensions. The vortex shedding from a circular cyhnder has been recently investigated by a number of authors with the focus on the mechanism of momentum and vorticity transport [4, 5] and on the active control of the wake structure [6]. The transition of the flow to a threedimensional mode (180 < Re < 260) attracts particular interest. In this regime the slow asymptotics of the wake provides a challenging test for numerical methods since long integration times are necessary to resolve the flow evolution toward a limiting cycle. In the present work, time-resolved computations of vortex shedding from a circular cylinder for Reynolds numbers between 45 and 250 are performed to assess both accuracy and parallel efficiency of the present algorithm. The vortex wake structure as well as the averaged flow quantities for this flow regime are found to be in a good agreement with the experimental and computational data, obtained by other authors.
منابع مشابه
Comparison of Implicit Multigrid Schemes forThree-Dimensional Incompressible Flows
To develop a robust and efficient computational flow simulation tool for incompressible flow applications, a number of different implicit multigrid schemes for solving the three-dimensional incompressible Navier–Stokes equations are compared in the current study. These schemes consist of a common full approximation storage (FAS) multigrid algorithm implemented in conjunction with three differen...
متن کاملThree-dimensional unsteady incompressible flow computations using multigrid
We apply a robust and computationally efficient multigrid-driven algorithm for the simulation of time-dependent three-dimensional incompressible bluff body wakes at low Reynolds numbers (Re less than or equal to 350). The computational algorithm combines a generalized time-accurate artificial compressibility approach, a finite-volume discretization in space, and an implicit backward discretizat...
متن کاملFrom multi- to single-grid CFD on massively parallel computers: Numerical experiments on lid-driven flow in a cube using pressure–velocity coupled formulation
0045-7930/$ see front matter 2010 Elsevier Ltd. A doi:10.1016/j.compfluid.2010.08.009 ⇑ Corresponding author. E-mail address: [email protected] (Yu. Feldma A parallel implementation of a fully pressure–velocity coupled multigrid solver based on analytical solution accelerated coupled line Gauss Seidel (ASA-CLGS) smoother with grid partitioning is carried out. The parallelized algorithm is...
متن کاملTwo-dimensional Implicit Time Dependent Calculations for Incompressible Flows on Adaptive Unstructured Meshes
An implicit muItigrid-driven algorithm for two-dimensional incompressible laminar viscous flows is coupled with a mesh adaptation method to better capture the important features of the flow for time dependent problems. Time dependent calculations are performed implicitly by regarding each time step as a steady-state problem in pseudotime. The method of artificial compressibility is used to solv...
متن کاملImplementation of D3Q19 Lattice Boltzmann Method with a Curved Wall Boundary Condition for Simulation of Practical Flow Problems
In this paper, implementation of an extended form of a no-slip wall boundary condition is presented for the three-dimensional (3-D) lattice Boltzmann method (LBM) for solving the incompressible fluid flows with complex geometries. The boundary condition is based on the off-lattice scheme with a polynomial interpolation which is used to reconstruct the curved or irregular wall boundary on the ne...
متن کامل